Parallel heuristic search in Haskell
نویسندگان
چکیده
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming language Haskell suggest that modest real speedup can be achieved for the most interesting hard search cases.
منابع مشابه
Replicable parallel branch and bound search
Combinatorial branch and bound searches are a common technique for solving global optimisation and decisionproblems. Their performance oftendepends on good search order heuristics, refined over decades of algorithms research. Parallel search necessarily deviates from the sequential search order, sometimes dramatically and unpredictably, e.g. by distributing work at random. This can disrupt effe...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملMpp Parallel Haskell Preliminary Results
Preliminary Results Kei Davis http://www.c3.lanl.gov/~kei/kei.html Abstract MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from l...
متن کاملحل مسئله زمان بندی ماشینهای موازی نامرتبط با اهداف کل زودکرد وزنی و کل دیرکرد وزنی با استفاده از الگوریتم جستجوی پراکنده چند هدفه
The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...
متن کامل